Optimal depth-based regional frequency analysis
نویسندگان
چکیده
منابع مشابه
Depth-Based Shape-Analysis
In this paper we propose a new method for shape analysis based on the depth-ordering of shapes. We use this depth-ordering to non-parametrically define depth with respect to a normal control population. This allows us to quantify differences with respect to "normality". We combine this approach with a permutation test allowing it to test for localized shape differences. The method is evaluated ...
متن کاملIncorporating spatial dependence in regional frequency analysis
The efficiency of regional frequency analysis (RFA) is undermined by intersite dependence, which is usually ignored in parameter estimation. We propose a spatial index flood model where marginal generalized extreme value distributions are joined by an extreme-value copula characterized by a max-stable process for the spatial dependence. The parameters are estimated with a pairwise likelihood co...
متن کاملOptimal phase kernels for time-frequency analysis
We consider the design of kernels for time-frequency distributions through the phase, rather than amplitude, response. While phase kernels do not attenuate troublesome crosscomponents, they can translate them in the time-frequency plane. In contrast to previous work on phase kernels that concentrated on placing the cross-components on top of the auto-components, we set up a “don’t care” region ...
متن کاملOptimal kernels for time-frequency analysis
Current bilinear time-frequency representations apply a fixed kernel to smooth the Wigner distribution. However, the choice of a fixed kernel limits the class ofsignals that can be analyzed effectively. This paper presents optimality criteria for the design of signal-dependeni kernels that suppress cross-components while passing as much auto-component energy as possible, irrespective of the for...
متن کاملOptimal-Depth Sorting Networks
We solve a 40-year-old open problem on the depth optimality of sorting networks. In 1973, Donald E. Knuth detailed, in Volume 3 of “The Art of Computer Programming”, sorting networks of the smallest depth known at the time for n ≤ 16 inputs, quoting optimality for n ≤ 8. In 1989, Parberry proved the optimality of the networks with 9 ≤ n ≤ 10 inputs. In this article, we present a general techniq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hydrology and Earth System Sciences
سال: 2013
ISSN: 1607-7938
DOI: 10.5194/hess-17-2281-2013